Adaptive Triangulation of Point-Based Level Sets

نویسنده

  • Christopher Batty
چکیده

Point based level sets are a recently developed implicit surface representation that combines the benefits of point-set surfaces and grid-based level sets. They provide convenient topology changes and adaptivity and are thus useful for tracking the evolution of heavily deforming surfaces. However, it is often useful to extract an explicit mesh from the implicit surface, for example for rendering or post-processing. In this report we adapt an algorithm originally designed for triangulating point-set surfaces to be used with point-based level sets, describe the necessary modifications and present a successful implementation, and discuss various details not provided in the original paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splat-based surface reconstruction from defect-laden point sets

We introduce a method for surface reconstruction from point sets that is able to cope with noise and outliers. First, a splat-based representation is computed from the point set. A robust local 3D RANSAC-based procedure is used to filter the point set for outliers, then a local jet surface – a lowdegree surface approximation – is fitted to the inliers. Second, we extract the reconstructed surfa...

متن کامل

Adaptive Inverse Control of Flexible Link Robot Using ANFIS Based on Type-2 Fuzzy

This paper presents a novel adaptive neuro-fuzzy inference system based on interval Gaussian type-2 fuzzy sets in the antecedent part and Gaussian type-1 fuzzy sets as coefficients of linear combination of input variables in the consequent part. The capability of the proposed ANFIS2 for function approximation and dynamical system identification is remarkable. The structure of ANFIS2 is very sim...

متن کامل

Adaptive Thinning for Terrain Modelling and Image Compression

Adaptive thinning algorithms are greedy point removal schemes for bivariate scattered data sets with corresponding function values, where the points are recursively removed according to some data-dependent criterion. Each subset of points, together with its function values, defines a linear spline over its Delaunay triangulation. The basic criterion for the removal of the next point is to minim...

متن کامل

Adaptive Thinning for Bivariate Scattered Data

This paper studies adaptive thinning strategies for approximating a large set of scattered data by piecewise linear functions over triangulated subsets. Our strategies depend on both the locations of the data points in the plane, and the values of the sampled function at these points — adaptive thinning. All our thinning strategies remove data points one by one, so as to minimize an estimate of...

متن کامل

Fast generation of Importance-sampled Point Sets with Associated Delaunay Triangulation

In this paper, we propose a novel method to generate Delaunaytriangulated point sets from a given density function in 2D. In order to accomplish this, we employ a Penrose-tiling-based importancesampling strategy, which not only provides a good sampling point pattern with a local blue-noise distribution, but also provides a balanced base geometric structure from which we can efficiently derive a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006